Strong tree-cographs are birkhoff graphs
نویسندگان
چکیده
منابع مشابه
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of treecographs when the decomposition tree is a part of the input. We also show that there exists an efficient algorithm for the strong chromatic index of permutation graphs.
متن کاملKRUSKALIAN GRAPHS k-Cographs
A class of graphs is Kruskalian if Kruskal’s theorem on a well-quasi-ordering of finite trees provides a finite characterization in terms of forbidden induced subgraphs. Let k be a natural number. A graph is a k-cograph if its vertices can be colored with colors from the set {1, . . . ,k} such that for every nontrivial subset of vertices W there exists a partition {W1,W2} into nonempty subsets ...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملk-Cographs are Kruskalian
A class of graphs is Kruskalian if Kruskal’s theorem on a well-quasi-ordering of finite trees provides a finite characterization in terms of forbidden induced subgraphs. Let k be a natural number. A graph is a k-cograph if its vertices can be colored with colors from the set {1, . . . ,k} such that for every nontrivial subset of vertices W there exists a partition {W1,W2} of W into nonempty sub...
متن کاملStrong Triadic Closure in Cographs and Graphs of Low Maximum Degree
The MaxSTC problem is an assignment of the edges with strong or weak labels having the maximum number of strong edges such that any two vertices that have a common neighbor with a strong edge are adjacent. The Cluster Deletion problem seeks for the minimum number of edge removals of a given graph such that the remaining graph is a disjoint union of cliques. Both problems are known to be NP-hard...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90100-x